Cooperative caching versus proactive replication for location dependent request patterns
نویسندگان
چکیده
منابع مشابه
Cooperative caching versus proactive replication for location dependent request patterns
Today’s trend to create and share personal content, such as digital photos and digital movies, results in an explosive growth of a user’s personal content archive. Managing such an often distributed collection becomes a complex and time consuming task, indicating the need for a personal content management system that provides storage space transparently, is quality-aware, and is available at an...
متن کاملCooperative Caching on Mobile Devices for Location Dependent Queries
Location dependent services are expected to become a very important revenue stream in the future. To enhance performance of location dependent queries there have been several research efforts in the past. Most of these have been focused on client side caching with extremely little work on cooperative caching. Cooperative caching might particularly be a very good solution to improve performance ...
متن کاملProactive Approach for Cooperative Caching in Mobile Adhoc Networks
In Mobile Adhoc Networks (MANETs), due to frequent network partition, data availability is lower than that in traditional wired networks. Cooperative caching provides an attractive solution for this problem. In this paper we propose a new proactive approach for cooperative caching in MANETs, in which we will cache the data of leaving node. Here each mobile node will broadcast a “LEAVE” message ...
متن کاملUsage Patterns in Cooperative Caching
The amount of information requested over the World Wide Web has increased enormously during the past decade. Web caching helps to reduce service times, balance the load to origin servers, and brings content closer to the user. Since duplicating and distributing files amongst proxy caches has proved to be insufficient, cooperative caching aims to ameliorate the shortcomings of basic replication ...
متن کاملOptimal Content Replication and Request Matching in Large Caching Systems
We consider models of content delivery networks in which the servers are constrained by two main resources: memory and bandwidth. In such systems, the throughput crucially depends on how contents are replicated across servers and how the requests of specific contents are matched to servers storing those contents. In this paper, we first formulate the problem of computing the optimal replication...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Network and Computer Applications
سال: 2011
ISSN: 1084-8045
DOI: 10.1016/j.jnca.2010.12.007